Chattering and congestion collapse in an overload switching control

Chattering and Congestion Collapse in an Overload Switching Control

Routing mechanisms for stochastic networks are often designed to produce state space collapse (SSC) in a heavy-traffic limit, i.e., to confine the limiting process to a lower-dimensional subset of its full state space. In a fluid limit, a control producing asymptotic SSC corresponds to an ideal sliding mode control that forces the fluid trajectories to a lower-dimensional sliding manifold. With...

متن کامل

Chattering and Congestion Collapse in an Overload Switching Control By

Routing mechanisms for stochastic networks are often designed to produce state space collapse (SSC) in a heavy-traffic limit, i.e., to confine the limiting process to a lower-dimensional subset of its full state space. In a fluid limit, a control producing asymptotic SSC corresponds to an ideal sliding mode control that forces the fluid trajectories to a lower-dimensional sliding manifold. With...

متن کامل

development and implementation of an optimized control strategy for induction machine in an electric vehicle

in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...

15 صفحه اول

A Switching Fluid Limit of a Stochastic Network Under a State-Space-Collapse Inducing Control with Chattering

Routing mechanisms for stochastic networks are often designed to produce state space collapse (SSC) in a heavy-traffic limit, i.e., to confine the limiting process to a lower-dimensional subset of its full state space. In a fluid limit, a control producing asymptotic SSC corresponds to an ideal sliding mode control that forces the fluid trajectories to a lower-dimensional sliding manifold. With...

متن کامل

Lecture 6: Congestion collapse

Last lecture, we discussed the sliding window protocol, and showed that its throughput is W RTT , where W is the window size and RTT is the minimum round-trip time. We also showed that the “correct” value of the window W is C ∗ RTT , where C is the bottleneck link’s capacity along the path from the sender to the receiver. A window that is larger than C ∗RTT (i.e., the bandwidth-delay product or...

متن کامل

Chattering and congestion collapse in an overload switching control

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

منابع مشابه